منابع مشابه
Vertex Deletion for 3D Delaunay Triangulations
We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C⊗(P )) time, where P is the set of vertices neighboring q in DT(S) and C⊗(P ) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P ). Experiments show that our approach is significantly faste...
متن کاملMorphological Operations on Delaunay Triangulations
Algorithms are presented which allow to perform morphological transformations on unorganised sets of points represented by their Delaunay triangulation. The results show that these algorithms could behaves as morphological operators such as erosion, dilatation, opening do. As a matter of fact, they actually act as “shape filter”. These algorithms are applied to the problem of scene reconstructi...
متن کاملDensity Estimation on Delaunay Triangulations
Density Estimation is a very popular method to compute global illumination solutions in a complex virtual scene. After simulating the re ection paths of a large number of photons in the scene, the illumination at a surface point is approximated by estimating the density of photon hits in the point's surrounding. In this paper we describe a novel approach to compute such a density approximation ...
متن کاملOn Deletion in Delaunay Triangulation
This paper present how space of spheres and shelling can be used to delete e ciently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of H...
متن کاملRestricted Constrained Delaunay Triangulations
We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2002
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195902000815